Conversion of Regular Grammar to Finite Automata